Domain wall encoding of discrete variables for quantum annealing and QAOA
نویسندگان
چکیده
منابع مشابه
Discrete and Canonical Quantum Variables
Quantum mechanics, and in particular the language of quantum mechanics, is deeply entangled with the way physics is done on its many branches. Therefore, the interpretation of the formalism might have a crucial role on areas where both theoretical and experimental efforts are highly developed. Nuclear physics, with its need to take into account so many different effects – which are better under...
متن کاملdevelopment of different optical methods for determination of glucose using cadmium telluride quantum dots and silver nanoparticles
a simple, rapid and low-cost scanner spectroscopy method for the glucose determination by utilizing glucose oxidase and cdte/tga quantum dots as chromoionophore has been described. the detection was based on the combination of the glucose enzymatic reaction and the quenching effect of h2o2 on the cdte quantum dots (qds) photoluminescence.in this study glucose was determined by utilizing glucose...
Discrete optimization using quantum annealing on sparse Ising models
*Correspondence: William G. Macready, D-Wave Systems, 3033 Beta Ave, Burnaby, BC V5G 4M9, Canada e-mail: [email protected] This paper discusses techniques for solving discrete optimization problems using quantum annealing. Practical issues likely to affect the computation include precision limitations, finite temperature, bounded energy range, sparse connectivity, and small numbers of qubits. To...
متن کاملFaster Annealing Schedules for Quantum Annealing
New annealing schedules for quantum annealing are proposed based on the adiabatic theorem. These schedules exhibit faster decrease of the excitation probability than a linear schedule. To derive this conclusion, the asymptotic form of the excitation probability for quantum annealing is explicitly obtained in the limit of long annealing time. Its first-order term, which is inversely proportional...
متن کاملQuantum Annealing for Clustering
This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments show the proposed QA algorithm finds better clustering assignments than SA. Furthermore, QA is as easy as SA to implement.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Science and Technology
سال: 2019
ISSN: 2058-9565
DOI: 10.1088/2058-9565/ab33c2